Graph Matching for Shape Retrieval
نویسندگان
چکیده
This paper describes a Bayesian graph matching algorithm for data-mining from large structural data-bases. The matching algorithm uses edge-consistency and node attribute similarity to determine the a posteriori probability of a query graph for each of the candidate matches in the data-base. The node feature-vectors are constructed by computing normalised histograms of pairwise geometric attributes. Attribute similarity is assessed by computing the Bhattacharyya distance between the histograms. Recognition is realised by selecting the candidate from the data-base which has the largest a posteriori probability. We illustrate the recognition technique on a data-base containing 2500 line patterns extracted from real-world imagery. Here the recognition technique is shown to signi cantly outperform a number of algorithm alternatives.
منابع مشابه
Graph-based Shape Representation for Object Retrieval
Shape analysis has been an area of interest and research in image processing for a long time. Developing a discriminant shape representation and description method is a concern in many applications like image retrieval systems. This paper presents a new shape representation model which is based on graphs. We also present developed similarity measure technique to find correspondences between sha...
متن کاملMatching of shapes bound by freeform curves
Matching and retrieval of shapes, both in two and three dimensions, have been a topic of interest to researchers in the field of computer graphics, vision and geometric modeling for at least a decade. In this paper, a shape is assumed to be represented as set of freeform curved boundaries. A prominent approach to matching curved outline is the graph-based approach, where a skeleton is used as a...
متن کاملPartial Matching by Structural Descriptors
The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure and geometry in the matching process. First of all, the structure of the shape is coded in a graph where each node is associated to a sub-part of the shape. Then, the matching between two shapes is approached using a g...
متن کاملThe Augmented Multiresolution Reeb Graph Approach for Content-based Retrieval of 3d Shapes
This article presents a 3D shape matching method for 3D mesh models applied to content-based search in database of 3D objects. The approach is based on the multiresolution Reeb graph (MRG) proposed by Hilaga et al . MRG provides a rich representation of shapes able in particular to embed the object topology. In our framework, we consider 3D mesh models of various geometrical complexity, of diff...
متن کاملComplex Fiedler Vectors for Shape Retrieval
Adjacency and Laplacian matrices are popular structures to use as representations of shape graphs, because their sorted sets of eigenvalues (spectra) can be used as signatures for shape retrieval. Unfortunately, the descriptiveness of these spectra is limited, and handling graphs of different size remains a challenge. In this work, we propose a new framework in which the shapes (3D models in ou...
متن کاملContent based image retrieval for matching images of improvised explosive devices in which snake initialization is viewed as an inverse problem
Improvised explosive devices (IEDs) are common and lethal instruments of terrorism, and linking a terrorist entity to a specific device remains a difficult task. In the effort to identify persons associated with a given IED, we have implemented a specialized content based image retrieval system to search and classify IED imagery. The system makes two contributions to the art. First, we introduc...
متن کامل